Managing game metrics and authorizations

ABSTRACT

Various metrics as may be deployed in an active, passive, or hybrid validation architecture are disclosed. A computing device configured to monitor network game activity may identify an inconsistency between user game data and a particular game metric governing a particular aspect of the network gaming environment. Upon identification of an inconsistency between game data and a game metric, which may indicative of illicit game play, a validation process (e.g., active, passive, and/or hybrid) may be implemented to further confirm the existence of illicit game. Alternatively, an action to maintain integrity of the gaming community may be executed without further confirmation whereby a purportedly illicit game device may be ejected from the network.

CROSS-REFERENCE TO RELATED APPLICATIONS

The present application is a continuation and claims the prioritybenefit of U.S. patent application Ser. No. 15/391,616 filed Dec. 27,2016, now U.S. Pat. No. 10,293,262, which is a continuation and claimsthe priority benefit of U.S. patent application Ser. No. 14/101,870filed Dec. 10, 2013, now U.S. Pat. No. 9,526,990, which is acontinuation and claims the priority benefit of U.S. patent applicationSer. No. 11/449,141 filed Jun. 7, 2006, now U.S. Pat. No. 8,622,837,which is a continuation-in-part and claims the priority benefit of U.S.patent application Ser. No. 11/415,881 filed May 1, 2006, now U.S. Pat.No. 8,771,061, which is a continuation-in-part and claims the prioritybenefit of U.S. patent application Ser. No. 11/386,039 filed Mar. 20,2006, now U.S. Pat. No. 7,480,656. The disclosures of the aforementionedapplications are incorporated herein by reference.

BACKGROUND OF THE INVENTION Field of the Invention

The present invention relates, generally, to network gaming and moreparticularly to various metrics that may be implemented in the contextof various systems and methods for validating game users and devices ina networked community of game players.

Description of the Related Art

Conventionally, users of electronic games compete with one another byselecting a two-player option associated with a particular electronicgame via a single home gaming console. Accordingly, two players can playat the same time or one-at-a-time in order to compete for points orother awards associated with the particular electronic game.

As electronic game consoles have become more popular and networktechnologies have become more pervasive, more options for head-to-headcompetition have become available. Some electronic game consoles areequipped with modems or other network connectors for allowing users tocommunicate over a network through the exchange of data related to thegame. By communicating over a network, users can connect to variousother users' gaming consoles either directly or via intermediatecomputing nodes (e.g., a central server or other game consoles in anetwork) and compete against those various other users while playing anetwork game.

Disadvantageously, some users manipulate the network game in order togain unfair advantages while competing with other users playing the samenetwork game. For example, a user may slow or delay the rate at whichthe user's data is sent to other users so that the various other usersdo not receive the user's data in time to react appropriately.

Unscrupulous users may employ an external hardware device thatmanipulates the generation of or access to certain game data whereby agame character may be endowed with special powers, abilities orattributes (e.g., lives, ammunition, and weapons) not genuinely earnedduring game play. Similarly, a game character may become impervious(e.g., invisible) to attacks by other game players.

Certain software methodologies exist (either alone or in conjunctionwith the aforementioned hardware devices) wherein code is temporarily orpermanently installed and/or modified in a gaming device allowing forsimilar advantages. Various other means and methods are known andemployed by users in order to cheat or gain an unfair advantage duringthe course of networked ‘community’ game-play.

Cheating decreases user enjoyment of participating in a networkedcommunity game environment. For example, a particular user playing anetwork game without any illicit outside aides (e.g., cheat codes,hacks, and so forth) is at a distinct disadvantage versus a user who ismaking use of such illicit aides. The user who is not cheating may beoverpowered, outgunned, or otherwise inferior in some respect to a userwho is cheating regardless of the individual skills of those users. Ifthe user who does not cheat is continually defeated by a user who doescheat—and often in quick and decisive fashion—the non-cheating user maylose interest in a particular game, a particular game network, or aparticular product or service provider.

This loss of interest adversely affects game developers and networkservice providers who will sell less game titles or find fewer usersutilizing their network game services, respectively. As such, there isan inherent interest for game developers, service providers, and honestgame users to identify and eliminate cheating in a network or communitygame environment.

SUMMARY OF THE PRESENTLY CLAIMED INVENTION

An exemplary method for validating devices in a gaming network includesreceiving game data generated by at least one device in the gamingnetwork, the at least one device configured for play of a network game.At least one game metric from a library of game metrics is identified,the particular metric associated with the received game data. At leastone aspect of the received game data is identified that does notcorrespond to the at least one game metric identified from the libraryof game metrics. Upon that identification, a one or more queries aresent to the device that generated the game data that does not correspondto the at least one game metric. A response to that query is utilized todetermine whether the queried device is valid for continued play of thenetwork game.

Another exemplary method for validating devices is also disclosed. Thismethod comprises monitoring one or more devices interacting with anetwork game in the gaming network. Game data is received from thedevices and evaluated in the context of at least one game metricassociated with the particular network game. A determination is made asto whether the game data adheres to the particular metric whereby avalidation process is implemented if the game data does not adhere tothe aforementioned metric.

A system for validating client computing devices in a network gameenvironment is also disclosed. An exemplary embodiment of the systemincludes a monitoring module configured to monitor game data receivedfrom one or more client computing devices playing a network game in thenetwork game environment. The system also includes a rules librarycomprising one or more game metrics associated with the network game andan analysis engine configured to access the game metrics from the ruleslibrary and to determine whether the received game data complies withthe accessed game metric. A query engine may also be implemented in theaforementioned system for the purpose of determine whether the one ormore computing devices are validated based on a response to a queryengine generated query.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates a schematic diagram of an exemplary architecture forvalidating network users according to various embodiments of the presentinvention;

FIG. 2A illustrates a block diagram of an exemplary electronicentertainment system that may be utilized with certain embodiments ofthe present invention;

FIG. 2B illustrates a block diagram of a portion of an alternativeexemplary electronic entertainment system including a control processor,a plurality of processing units, and a plurality of local memories thatmay be utilized with certain embodiments of the present invention;

FIG. 3 illustrates an exemplary validation node according to anexemplary embodiment of the present invention;

FIG. 4 illustrates a flow diagram of an exemplary process for activelyvalidating network game users according to an exemplary embodiment ofthe present invention;

FIG. 5 illustrates a flow diagram of an exemplary process for passivelyvalidating network game users according to an embodiment of the presentinvention;

FIG. 6 illustrates a flow diagram of an exemplary process for validatingnetwork game users according to a hybrid validation scheme in accordancewith an exemplary embodiment of the present invention.

DETAILED DESCRIPTION

FIG. 1 illustrates a schematic diagram of an exemplary architecture forvalidating network game users according to various embodiments of thepresent invention. One or more clients 102 may include one or morenetwork games 104. Network game 104 may be built-in (e.g., pre-loaded)to the client 102 or be introduced through an optical disk or other datastorage medium. Network game 104 may also be obtained over a network asfurther discussed herein. The client 102 may be connected to a server108 via a communications network 106 or to one another through an ad hocnetwork.

The client 102 may comprise a game console such as a PlayStation® 3, alaptop computing device, a portable game device such as the PlayStation®Portable, a desktop computing device, a cellular telephone, or any otherdevice capable of executing the network game 104 and connecting to thenetwork 106 or, alternatively, an ad hoc network. In some embodiments,the client 102 may be identified by an identification number such as aclient ID or an address mechanism such as an IP address. In otherembodiments, a user of the client 102 may ‘sign on’ to a network with auser name and/or password, which may be temporarily or permanentlyassociated with the client 102.

In some embodiments of the present invention, the server 108 may includethe network game 104 and the clients 102 may access the network game 104on the server 108 via the network 106. The network game 104 on theserver 108 may be the entire game, a portion of the game, data relatedto the game or simply a node allowing for the pass though, observationand/or collection of data related to the game 104 as the game 104 isplayed by users in the game community. The network game 104 may besimilarly organized at various clients 102 (e.g., portions of the gameor game data related to the game). Network game 104 may also be providedthrough, for example, a third-party content library server. In such anembodiment, the library server may or may not be a participating memberof the presently disclosed validation architecture.

It should be understood that the reference to a client 102 and a server108 is merely for the convenience of understanding various embodimentsof the present invention. Embodiments of the present invention may beimplemented in the context of a peer-to-peer network, a client-servernetwork, or within a peer-group (e.g., a specified group of peers).Therefore, in some instances, a client may function as a server and viceversa depending on the timing and the nature of a data exchange. Forexample, various clients in a peer-to-peer network may each comprise aportion of a network game 104 or data related to that game 104 and maysend and receive the same. As such, any reference to a client or aserver is meant to be inclusive of operations performed by one or bothcomputing entities unless specified otherwise by a specific limitationin the claims. In some instances, a device with client/serverfunctionality may be referred to by the generic moniker, ‘network node,’computing node,' or ‘network device.’ In that regard, client 102 andserver 108 may both be considered network or computing nodes or anetwork device.

The network game 104 may comprise software that may be processed on orby the client 102 and/or that allows for or facilitates communicationand data exchanges with the other clients 102 and server 108 via thenetwork 106. The network 106 may include, for example, the Internet.Other proprietary or closed networks may be used either exclusively orin conjunction with the Internet. Certain security protocols (e.g., SSLor VPN) or encryption methodologies may be used to ensure the securityof data exchanges over network 106, especially if the network 106 is apublicly accessible network such as the Internet.

Users associated with each of the clients 102 may interact with otherusers playing the network game 104. Accordingly, the users at each ofthe clients 102 may compete with one another despite not beingphysically present with one another or sharing a common gaming device orconsole.

In one exemplary embodiment, the server 108 may monitor the usersplaying the network game 104 via the network 106. The clients 102 mayrequest data from the server 108, such as information pertinent to theparticular network game 104 being played, bug patches, and so forth. Anytype of communication exchange between the clients 102 and the server108 is within the scope of the various embodiments of the presentinvention. Further, in some embodiments of the present invention, morethan one server 108 may be connected to the network 106 for the purposeof communicating with the clients 102. For example, back-up orredundancy servers as well as servers with particular tasks such asstoring identification information or preferences related to aparticular user as well as servers tasked with certain DRM, advertising,or payment responsibilities.

In other embodiments of the present invention, the clients 102 maymonitor the network games 104 being played by the other clients 102(e.g., as individual nodes in a peer-to-peer network or peer-groupnetwork). The clients 102 may communicate data generated during themonitoring process to the server 108 or the clients 102 may store andprocess the data themselves. For example, in a peer-to-peer networkscenario, each of the nodes in the network may monitor other nodes inthe network for certain illicit behaviors.

The validation process implemented by the server 108, clients 102,and/or any one of a variety of nodes in the network may detect cheatingor unusual activity with respect to the network game 104. For example, agame character may accrue more points than allowed or normally allotted,the game character may possess stronger powers than the network game 104generally provides, and so forth. Any type of unusual behavior oractivity may be detected via the monitoring process discussed herein(e.g., passive validation), as result of random queries (e.g., activevalidation) or a combination of the two (e.g., hybrid validation).

Referring now to FIG. 2A, a block diagram of one embodiment of anexemplary electronic entertainment system 200, such as may constituteclient 102 and for playing the network game 104 in accordance with oneembodiment of the invention is shown. The system 200 may comprise, butis not limited to, a main memory 202, a central processing unit (CPU)206, vector processing units VU0 204 and VU1 208, a graphics processingunit (GPU) 210, all of which may be coupled via a bus 236 to aninput/output processor (IOP) 212. The system 200 may also comprise anIOP memory 214, a controller interface 216, a memory card 218, aUniversal Serial Bus (USB) interface 220, and an IEEE 1394 interface222. The system 200 may further include an operating system read-onlymemory (OS ROM) 224, a sound processing unit (SPU) 226, an optical disccontrol unit 228, and a hard disc drive (HDD) 230, all of which may beconnected via a bus 238 to IOP 212.

Some embodiments of the system 200 may also include a network adaptor240, which may offer an Ethernet connection 242 and/or telephonyconnection 244. The system 200 is, in one embodiment, an electronicgaming console; however, the system 200 (or portions thereof) may alsobe implemented as a general-purpose computer, a set-top box, a hand-heldgaming device, or in a mobile device such as a cellular phone. It shouldfurther be noted that various other system architectures may be utilizedwithin the scope of the present invention.

An example of such an architecture is shown in FIG. 2B, whichillustrates a portion of an electronic entertainment system 250 based ona Cell processor 252. Certain aspects of a computer architecture andhigh speed processing model utilizing a Cell processor are disclosed inU.S. patent publication number 2002-0138637 for a “Computer Architectureand Software Cells for Broadband Networks,” the disclosure of which isincorporated herein by reference. The Cell processor architecturerepresents the work of Sony Computer Entertainment Inc., KabushikiKaisha Toshiba, and International Business Machines Corporation.

Through the use of the aforementioned Cell processor, data andapplications may be processed and packaged into uniquely identified anduniformly formatted software cells. The uniformity of structure andunique identification facilitates the processing of applications anddata throughout a network of Cell processor equipped computing devices.For example, one computing device may formulate a software cell but candistribute that cell to another device for processing. Thus, the cellsmay migrate throughout a network for processing on the basis of theavailability of processing resources on the network.

The cell processor 252, in one exemplary embodiment, comprises a mainmemory 254, a single power processor element (PPE) 256 and eightsynergistic processor elements (SPE) 258. The cell processor 252 may beconfigured, however, with more than one PPE and any number of SPEs 258.Each SPE 258 comprises a synergistic processor unit (SPU) and a localstore (LS).

Memory 254, PPE 256, and SPEs 258 may communicate with each other andwith an I/O device 260 over, for example, a ring-type-elementinterconnect bus (EIB) 264 coupled to a bus interface controller (BIC).The PPE 256 and SPEs 258 may access the EIB 264 through bus interfaceunits (BIU). The PPE 256 and SPEs 258 may access the main memory 254over the EIB 264 through memory flow controllers (MFC) and memoryinterface controller (MIC).

Memory 254 may comprise a program 262 that implements executableinstructions. The instructions may be read from a CD/ROM or otheroptical disc in CD/DVD reader 266 coupled to the I/O device 260, theCD/ROM or other optical disc being loaded into the reader 266. TheCD/ROM, too, may comprise a program, executable instructions, or otherdata 274.

In some embodiments of the aforementioned processor, PPE 256 may be astandard processor capable of stand-alone processing of data andapplications. In operation, PPE 256 may schedule and orchestrate theprocessing of data and applications by SPEs 258 and the associated SPU.In one embodiment, the SPU may be a single instruction, multiple data(SIMD) processor. Under the control of PPE 256, the SPUs may processdata and application in a parallel and independent manner. MIC maycontrol accesses by PPE 256 SPUs to data and applications in main memory254.

Returning to FIG. 2A, which may implement a Cell processor like thatdescribed in FIG. 2B, the CPU 206, the VU0 204, the VU1 208, the GPU210, and the IOP 212 may communicate via a system bus 236. The CPU 206may communicate with the main memory 202 via a dedicated bus 234. TheVU1 208 and the GPU 210 may also communicate with one another via adedicated bus 232. The CPU 206 executes programs stored in the OS ROM224 and the main memory 202. The main memory 202 may contain pre-storedprograms and may also contain programs transferred via the IOP 212 froma CD-ROM, DVD-ROM, or other optical disc (not shown) using the opticaldisc control unit 228. The IOP 212 may be configured to control dataexchanges between the CPU 206, the VU0 204, the VU1 208, the GPU 210 andother devices of the system 200, such as the controller interface 216,or from other such systems via the network adaptor 240.

The GPU 210 may execute drawing instructions from the CPU 206 and theVU0 204 to produce images for display on a display device (not shown).The VU1 208 may be configured to transform objects fromthree-dimensional coordinates to two-dimensional coordinates, and sendthe two-dimensional coordinates to the GPU 210. The SPU 226 may executeinstructions and processes data to produce sound signals that are outputon an audio device (not shown).

A user of the system 200 may provide instructions via the controllerinterface 216 to the CPU 206, which may be coupled to a control devicecomprising, for example, a joystick, directional buttons, and/or othercontrol buttons. For example, the user may instruct the CPU 206 to storecertain game information on the memory card 218, which may be removable(e.g., a flash memory or other non-volatile memory card), or mayinstruct a character in a game to perform some specified action. Otherdevices may be connected to the system 200 via the USB interface 220 andthe IEEE 1394 interface 222, such as an external hardware deviceallowing for illicit gaming behavior (i.e., cheating).

Some embodiments of the system 200 may comprise a network adaptor 240.The network adaptor 240 may be configured to provide the hardwarefunctionality necessary for the system 200 to connect to a network. Thenetwork adaptor 240 may comprise, for example, a system connector thatoperates to connect the adaptor 240 to the system 200 through anexpansion bus connector 246. The network adaptor 240 may also comprise apower connector and data connector to allow for the provisioning ofpower from the system 200 to the adaptor 240 and the exchange of databetween the system 200 and the adaptor 240. In some embodiments of thepresent invention, the network adaptor 240 may also require theinstallation of certain software in the system 200 to allow foridentification and connection to a particular IP address and/or dial-upto a particular Internet Service Provider. Software may also provideother functionalities, such as the creation and maintenance of userprofiles, in addition to functional interaction between the system 200and the network adaptor 240.

The network adaptor 240 may also comprise an Ethernet connection 242.Through the Ethernet connection 242, a network cable (e.g., a 100Base-TX or 10-Base T) may be coupled to the network adaptor 240 forconnection to a network. The network cable may, for example, becommunicatively coupled to a DSL or cable modem. The network cable mayalso be communicatively coupled to, for example, a router via a LANport; the router may then be coupled to a DSL or cable modem through aWAN port. In further embodiments, the Ethernet connection 242 may allowfor a network cable to be connected to a wireless Ethernet bridge. Thewireless Ethernet bridge may be communicatively coupled to a wirelessrouter utilizing, for example, an 802.11x protocol. The wireless routermay be further communicatively coupled to a cable or DSL modem.

The network adaptor 240 may also comprise a telephony connection 244.Through the telephony connection 244, a standard telephone line with,for example, an RJ-11C telephone connector may be connected to thenetwork adaptor 240 and a telephone wall jack. In this regard, thenetwork adaptor 240 may further comprise modem functionality such thatthe system 200 may communicate data over the public switched telephonenetwork via the telephony connection 244. Other network connectionmethodologies and system architectures may be implemented within thescope of the present invention such as those disclosed in U.S. patentapplication publication number 2003-0142661 for a “System and Method forDistributing Data between a Telephone Network and an EntertainmentNetwork,” the disclosure of which is incorporated herein by reference.

FIG. 3 illustrates an exemplary validation node, such as the server 108discussed in FIG. 1, according to one exemplary embodiment of thepresent invention. An optional rules generator 302 may create and/orprocess rules associated with the network game 104. The rules mayinclude, for example, parameters for a game environment such as the gamemetrics discussed herein. In some embodiments, the rules/metrics mayinclude, but are not limited to, appropriate character fatigue, speed,character strength, goals, power, ammunition, temporal variables, scoreranges, prerequisites for advancement, frequency, and so forth.

Similarly, rules in the rules library 304 may encompass any identifiableaspect of the gaming environment or the hardware and/or software relatedto generating that environment. For example, the overwriting ormodification of certain code in main memory 202, the presence of certainhardware devices with a particular device signature present in system200 via USB Interface 220 or IEEE 1394 Interface 222 or the presence ofcertain data on a memory card 218 may be subject to a rule (e.g.,prohibiting the presence of devices evidencing a particular signature).The receipt or presence of remnants of certain instruction threadsincluding number, location or specific characteristics in, for example,main memory 202 or IOP memory 214 may also be subject to rulesvalidation (e.g., cheating may not immediately be occurring but thepresence of prior instruction threads related to cheating indicatecheating did at one point occur). The blocking of the transmission orreceipt of particular data via network adaptor 240 may also constitutethe basis for a rule (e.g., prohibitions of particular data transfersindicate cheating).

Rules are inclusive and may be independently generated by the optionalrules generator 302 or otherwise related to data provided to the rulesgenerator 302 (e.g., by a game developer). Optional rules generator 302,in this regard, may observe (e.g., through monitoring module 306)certain game parameters and develop a rule based on its observations ofa particular network game 104. For example, the generator 302 mayobserve that gaining access to a particular level always requiresmeeting certain prerequisites. The generator 302 may develop a rulereflecting that if a user has achieved access to that particular leveland has not met those prerequisites, that user is perhaps engaged inillicit behavior requiring validation. Those prerequisites may beobserved by the generator 302 and/or related to information provided tothe generator 302 by any number of sources (e.g., user, developer,automated signature update generators, and so forth).

A rules library 304 may be provided for storing the pre-defined orgenerated rules. Rules may be embodied in any variety of file and/ordata types and the present invention does not seek to impose orotherwise limit the implementation of the same. Various other data maybe stored in the rules library 304 according to some embodiments of thepresent invention. For example, statistics about one or more users ofthe network game 104 may be stored in the rules library 304, or anyother storage medium or locale, according to some embodiments of thepresent invention. Alternative storage of statistics or otherinformation may occur remotely from a network node but is otherwiseaccessible via the network 106. In some embodiments, the rules may bedirectly input into the rules library 304 or may have been independentlyor cooperatively developed by the rules generator 302.

A monitoring module 306 may be configured to monitor user activity withrespect to the network game 104 at the client 102 via data exchangeswith the server 108 via the network 106. Any type of monitoring may beimplemented by the monitoring module 306 (e.g., periodic review of dataexchanges, constant review of data exchanges, review of data exchangesfrom particular nodes, etc.). According to one embodiment of the presentinvention, the monitoring module 306 may utilize rules in the ruleslibrary 304 and analysis provided by the analysis engine 308 topassively listen for or detect user activity that deviates from typicaluser activity associated with the network game 104 or that might suggestthe presence of such activity.

The data reviewed by monitoring module 306 may comprise normal game datagenerated in the course of game play (e.g., game metric related data).This may include data concerning position of a character, the number oflives remaining, the present score, and so forth. The data mayalternatively or further comprise data specifically generated for thepurposes of validation. This may include certain query response data,header data, encryption-related data, device status data and so forth.

Device status data may reflect the nature or identification of certaindevices or peripherals coupled to client 102. The manufacturer of aparticular network game 104 or client 102 may provide certainenhancement devices that, under certain circumstances (e.g., a special‘enhanced gamers’ session) are permitted during the game play or thatmight have substantial uses not related to cheating. The devices may beconfigured to provide a device signature identified by the client 102and communicated as a part of, for example, specifically generatedvalidation data monitored by the monitoring module 306. Similarly,illicit devices may generate an unrecognized or unapproved signature(either directly or through certain interactions with the client 102 ornetwork game 104) that subsequently causes the generation of validationdata by the client 102 as part of a device status report received bymonitoring module 306.

In some embodiments, the monitoring module 306 may be located inparticular client nodes within the network. For example, a particularnetwork game 104 (e.g., one distributed on a CD-ROM) may include certainaspects of a validation system and related software embedded with thegame software. As such, any client 102 in the network 106 may possessvalidation functionality in addition to a server 108.

A client 102 with validation software (e.g., monitoring module 306) mayoperate by itself or may operate in conjunction with the server 108 toensure valid game play in the network. Client 102, in one embodiment,may possess the monitoring module 306 and rules library 308 in additionto other possible aspects of the validation architecture illustrated inFIG. 3 through a particular network game 104 title. As such, the client102 may observe another client 102 in the network. If the monitoringmodule 306 observes illicit behavior through a data exchange withanother client 102 in the network 106 (as might be identified throughparticular rules in the rules library 304 and/or determinations by theanalysis engine 308), the client 102 observing such illicit behavior maytake certain action in response to the illicit behavior.

Alternatively, the valid client may report the invalid client to theserver 108 and the server 108 may engage in more detailed analysis ofthe purportedly illicit behavior through, for example, active queries asmay be generated by a query engine 310. The server 108 may also engagein certain behavior designed to maintain the integrity of the gamingnetwork such as dismissing the invalid client, overwriting invalid codethrough a pushed update, maintain a record of the invalid client and itsrelated user and so forth. These various integrity maintenance actionsmay also be executed by client 102 (e.g., dismissals) or by client 102in response to an instruction or request by the server 108.

By sharing and/or distributing validation responsibilities, bandwidthconsumption and processing power of the server 108 may be alleviated andpossibly avoids the involvement of an additional computing device in thevalidation relationship. That is, one client 102 may validate anotherand vice-versa through the course of regular data exchanges instead ofusing the server 108 as a validating intermediary.

Validation may also occur amongst a plurality of clients 102 in thenetwork 106. For example, a first client 102 may engage in monitoringfor a particular period of time with those responsibilities then takenover by a second client 102 at a later time. By randomly reassigningmonitoring responsibilities (e.g., via server 108), more adept cheatersthat may be able to avoid detection by a single monitoring entity mustnow deal with a constantly random and reassigned monitoring entity orentities.

Certain embodiments may also make use of group validation wherein aparticular client 102 must be validated by two or more other clients 102in order for that client 102 to be deemed valid or invalid. Groupvalidation may occur in conjunction with the server 108 whereby theserver may take into account the validation information from the groupof clients 102 and make an ultimate determination as to whether gameplay is allowed to continue for that particular client 102. One of theone or more clients 102 participating in the group validation mayalternatively be assigned lead validation responsibility and takeappropriate action in response to generated validation information.Leadership responsibilities may also be distributed amongst the membersof the group wherein the group acts collectively or certain client 102members of the group carry out designated responsibilities.

Reassignment of monitoring responsibilities may also make use of client102 with idle processing and bandwidth. For example, a client 102 mightbe connected to the network 106 but is not actively playing a game 106or is currently in a ‘waiting room’ or ‘game lobby’ awaiting entry intoa particular game 106. The available processing power of that otherwiseidle client 102 may then be put to use through validation assignments oractual validation activity.

In alternative embodiments, a client 102 may download certaininformation from the server 108 such as rules or updates for the ruleslibrary 304 that may be only partially embedded with the game softwareof a network game 104. These updates or downloaded libraries may betemporarily stored in, for example, main memory 210 or a memory card218. Rules updates or other related downloads may occur as a part of aregular schedule as determined by the server 108, as a part of a queryby a client 102 to the server 108 for any variety of information, orduring an initial log-on process wherein user names and passwords mightbe verified and that otherwise indicate the allowed permission of aparticular user or client 102 in the network 106.

Rules or metrics, as noted, may indicate how fast a character associatedwith the network game 104 can move. The monitoring module 306 mayobserve characters in the network game 104 moving in excess of thatspeed and may flag one or more characters that moves faster than therules indicate is allowed for further investigation or resolution. Themonitoring module 306 may (e.g., in hybrid validation architecture)independently activate the query engine 310 in light of this apparentlyillicit activity that suggests cheating and cause the query engine 310to deliver a query to the apparently offending node to better determinewhether the node is in a valid or invalid state.

Such activity is referred to a hybrid validation in that validationbegins passively (i.e., no active query to the offending node) but uponidentification of possible illicit behavior, a query, which is generallyindicative of active validation, is delivered to the offending node fora more accurate determination of valid or invalid behavior. Thecombination of passive and active validation, together, constituteshybrid validation.

In some embodiments (e.g., in passive validation architecture), theapparently offending node may be summarily removed from the networkwithout further investigation. Alternatively, data pertaining to thisapparently illicit activity may be logged for future use and/oranalysis. Such activity is referred to as passive validation in that noproactive determination of validity is made; the determination occurs asa result of ‘listening’ to traffic (e.g., game play information) fromthe node.

The monitoring module 306, in some embodiments—including both passiveand hybrid validation—may forward any flags or unusual activity to theanalysis engine 308. The analysis engine 308 may analyze the flaggedactivity to determine whether the activity is, in fact, illegal withrespect to the game environment constraints of the network game 104. Inother words, the analysis engine 308 determines whether the useractivity, in fact, violates the rules associated with the network game104.

The monitoring module 306 may receive data from the network game usersas the network game users interact with the network game 104. Forexample, the client 102 may periodically post data to the server 108 orto the other clients 102 related to the network game 104 and/or thenetwork game user's interaction with the network game 104. Themonitoring module 306 reviews (e.g., ‘listens to’) the data as it isposted in order to determine whether the network game user associatedwith the client 102 that posts the data is cheating and/or failing toadhere to the one or more rules associated with the network game 104, asdefined by the rules library 304. In an exemplary embodiment, themonitoring module 306 may forward the posted data to an analysis engine308 and the analysis engine 308 analyzes and/or evaluates the posteddata in light of rules from rules library 304 to determine whether thenetwork game user 104 associated with the client 102 that posts the datais cheating and/or failing to adhere to the one or more rules associatedwith the network game 104.

For example, the network game user playing the network game 104 may playa nearly perfect game, such as achieving higher than usual scores.While, in many cases, this may be indicative of cheating, the user maysimply be an above-average player. Data stored at the analysis engine308, the rules library 304 or in another data storage locale or means(e.g., an ongoing record of particular game player activity andindicating an ongoing increase in quality of play over several sessions)may be utilized to make a determination whether this player is per secheating or if further investigation via ongoing monitoring by themonitoring module 306 or, in the case of a hybrid validation scheme, aquery from query engine 310 as described in FIG. 5 below.

Analysis engine 308 may also determine that while a user of a networkgame 104 presently has a particular advantage, this advantage may be oneactually granted by the developer of the network game 104. For example,the game developer may have implanted an ‘Easter Egg’ or other ‘hidden’functionality or bonus in the game environment such as temporaryinvincibility or excess speed. Certain bonus codes may also berecognized by the network game 104 and allow for game character or gameenvironment enhancements. The analysis engine 308, through a query tothe rules library 304, may determine that this particular behavior—whilein any other context of the game would constitute cheating—is, in fact,permitted since the user has uncovered the Easter Egg or otherwise inputan authorized code providing for such enhanced ability. The analysisengine 308 may also determine whether such enhanced functionalities havebeen disabled with regard to a particular network game environment andwhether that activity, in light of that condition having been presentlydisabled, therein constitutes cheating.

The analysis engine 308 and/or the monitoring module 306, depending upona particular embodiment, may then instruct the query engine 310 to sendone or more queries to the user's game device (system 200) in order togather data that helps the analysis engine 308 determine whether theuser activity qualifies as cheating. The query engine 310 may sendpredetermined queries for the particular network game 104 or the queryengine 310 may generate specific queries for the network game 104 basedon the user activity that is flagged by the monitoring module 306.

For example, if the flagged behavior is one that is usually coupled witha particular cheat device (e.g., an external hardware mechanism), thequery engine 310 may send a query to the client 102 seeking processorthreads related to that device or seek a hash of memory that istraditionally modified by that device.

The query engine 310 may generate and sends queries to the client 102 onwhich the network game 104 is being played or that is otherwiseconnected to the server 108 to play the network game 104. Based on a theresponse to the query, analysis engine 308 may determine whether aclient 102 or other network node is presently, has been or is otherwiseconfigured to engage in illegal behavior (i.e., cheating).

Queries generated by the query engine 310 may be, in one exemplaryembodiment, asynchronous in that they may be generated and delivered atany time. Other embodiments of the present invention, however, mayutilize a particular schedule or time-table for the delivery of queriesin order to, for example, optimize consumption of bandwidth.Accordingly, a query may only be generated when bandwidth consumptionrelative to a particular network game 104 is at an ebb versus during ahigh computational, high data exchange point of game play. Similarly,queries may be scheduled subject to the number of nodes present in anetwork; upon entry of new nodes to the network; or upon any otherschedule as may be implemented by an administrator of the validationarchitecture.

Each node in the gaming community (e.g., client 102) may be configuredto receive the query and respond as set forth by a series ofinstructional headers in the query packet. Providing incorrect orinvalid data in response to the query may be construed as illicitbehavior (i.e., cheating) and the invalid node may be dismissed from thecommunity, logged, or otherwise dealt with as is determined by theparticular construct of the validation architecture in place in a givencommunity or with regard to a particular network game 104.

Failure of any particular node to respond to the query may be implicitlyconstrued as an invalid response (i.e., the queried node did not respondbecause that node does not possess or cannot calculate the properresponsive data). Each query, as a part of the aforementionedinstruction packet header, may reflect a time period in which a responsemust be generated and transmitted to the sending node. In otherembodiments, the sending node may simply time the response of the queryand unilaterally determine that a lack of response within a particularperiod of time constitutes an invalid response and therefore invalidatethe queried node.

In certain networks, delivery of a response may be delayed or impossibledue to a number of factors. For example, in a high traffic network, theproper and valid response may be generated by a queried node buttemporarily delayed by the network due to traffic or other datapriorities (e.g., the delivery of critical game data). The querying nodemay be configured to recognize when certain traffic conditions exist inthe network and to adjust (via query engine 310) the query response timefor providing a valid response.

Similar adjustments or allowances may be made in light of the particularnetwork over which a queried node is connected to the querying node(e.g., a DSL line v. a wireless network v. a 56 kbps dial-up modem). Aquery and response are, at least with regard to a valid node, morereadily transmitted and received over a DSL line, which comprises higherbandwidth than, for example, a dial-up modem. Similarly, if certainlightweight protocols are being used (e.g., UDP versus TCP), additionalleniency may be allowed in that UDP, for example, offers few errorrecovery services unlike TCP, which guarantees delivery of data packets.In such a scenario, the query packet may never be received by thequeried node and no indication of that failure will be communicated tothe querying node. The querying node, via query engine 310, may takesuch possibilities into consideration, in conjunction with analysisengine 308, when determining if a response has been timely received and,further, with regard to disposing of an implicitly invalidated node.

In other embodiments of the present invention, if no response isreceived in response to a query, the query engine 310 may re-transmitthe same query or, in order to prevent an illicit network node fromhaving the benefit of additional processing time to determine thecorrect response to the query, generate a fresh query to that node. Aparticular node may be given so many opportunities to provide a validresponse before the node is dismissed from the network or otherwisecataloged as having engaged in illicit community behavior.

The query itself may be intended to determine whether a node in thecommunity network is valid, that is, is the node running instructions orfunctioning as is expected (e.g., has the runtime code been modified).Various cheating mechanisms may introduce new code to the system 200,usually in main memory 202 or IOP memory 214 although code related toillicit activity may also be found on a memory card 218. Certain devicesignatures related to a cheat device connected to the system 200 mayfurther be identified at USB Interface 220 or IEEE 1394 Interface 222.The query seeks to determine whether known ‘cheat’ code is present orwhether certain native runtime code at, for example, main memory 202 orIOP memory 214, has been modified as the result of a user havingexecuted certain cheat code or the presence of a certain cheat deviceand its related signature, that cheat code having modified the nativeruntime code.

The query generated by the query engine 310, in one embodiment, maycomprise requesting a section of memory from the client 102, that is, astart address and size. The client 102 then answers the query with theappropriate number of bytes of memory commencing at the particularaddress as requested by the query engine 310. Query engine 310, in someembodiments, will request a limited number of memory addresses in thatthe query aims to identify known portions of runtime code that aretraditionally subject to modification or hacking with an aim towardcheating in a community network environment.

If the client 102 fails to respond to the query or provides theincorrect segment of memory as a result of the runtime code having beenaltered by illicit behavior (i.e., cheating), then the client 102 may bedismissed from the network or subject to other penalties or action(e.g., logging of an IP address, development of a record reflecting theclient 102 or an associated user having been engaged in illicitbehavior, restriction of bandwidth, etc.). A validated node (e.g.,client 102) will identify a portion of memory that matches theexpectations of the querying node (e.g., server 104) as reflected by arule in rules library 304.

In another embodiment, the query engine 310 may generate a queryconcerning memory in the context of a hash function and at the client102 in question. A hash function (H) is a transformation that takes avariable-size input (m) and returns a fixed-size string, which is calledthe hash value h (i.e., h=H(m)). The hash value concisely represents thelarger data sample from which it was computed.

In the context of an embodiment of the present invention, the querygenerated by query engine 310 may identify a particular address andportion of memory as in previous embodiments of the present inventionbut further require the application of a hash function against therelevant data in memory. The response to the query (i.e., the hashedportion of memory) would then be required to match the hash value at thequerying node (e.g., server 104) as might be reflected in a lookup tablein rules library 304.

Hashing, as noted above, may be utilized to transform a string ofcharacters associated with the memory requested into a shorterfixed-length value or key representative of the string. Through the useof hashing, efforts of more sophisticated hackers and cheaters arecomplicated in that it is nearly impossible to re-establish the originaldata from the hash value. A hash value is unique in the sense that twodata sets are highly unlikely to result in the same bit string and anyattempt to make changes to the data will negate the value and thus thesignature. A hash function H is one-way in that given a hash value h, itis computationally infeasible to find some input x such that H(x)=h.

For example, applying the CRC32 hash algorithm against the data string<Sony> results in the checksum <69D07CFC>; the data string <SonyComputer Entertainment> produces the checksum <EF7F99BA>; and the datastring <Sony Computer Entertainment America Inc.> results in the uniquechecksum <E3DE35CF>.

Examples of well-known hash functions that may be implemented in thepresent invention are MD2 and MD5 as reflected in Internet RFCs 1320 and1321, which are incorporated herein by reference as well as the SecureHash Algorithm (SHA) as is reflected in FIPS PUB 180, which is furtherincorporated herein by reference. CRC32 (cyclic redundancy check) isstill a further example of a hash function that may be implemented in anembodiment of the present invention. Other known or later developed hashfunctions are within the scope of various embodiments of the presentinvention.

While impossible to re-establish the original data from the hash value,since a query from query engine 310 may refer to a limited number ofmemory addresses, it is conceivable that a hacker or cheater couldindependently generate a look-up table in light of a particular hashalgorithm vis-a-vis a particular address and size (sometimes referredto, generally in the context of hacking computer passwords, as adictionary attack). Thus, when a query is received concerning aparticular address and size and hash algorithm, the cheater may providethe appropriate response via their look-up table. In order to overcomethis possibility, some embodiments of the present invention may utilizea certain degree of randomization as to the particular memory segmentsqueried.

Further embodiments of the present invention, as a means of overcomingindependent look-up tables, may employ salting the hash as a part of thequery generated by query engine 310. Salt is, in its simplest form, aunique string of some fixed length and is provided as a part of thequery in the header instructions of the query packet. The memory segmentidentified by the query is concatenated with the salt and subsequentlyhashed. The possibilities of ‘hacking’ a response to the query arediminished almost to the point of impossibility and the time andprocessing power required to develop an independent look-up tableon-the-fly would far exceed the response time limit to the query and theclient 102 would be timed out for failure to respond to the query. Aproper response will, like the memory query and memory/hash query,provide a response that matches the hash value at the querying node.Failure of the response to match that hash value may result in thequeried node being designated invalid and removed from the community orotherwise addressed as is appropriate in the particular validationarchitecture.

The query, in some embodiments of the present invention, may furtherinclude the detection of threads as they occur through the use ofcertain cheat devices. A processor thread is generally recognized as thearchitectural state within a processor representative of a sequence ofinstructions. Certain devices, when installed, will introduce a seriesof threads in certain numbers and in certain locales in order to allowfor the operation of the device in conjunction with the system 200. Aquery of, for example, main memory 202 or IOP memory 214 at client 102may be related to detection of a known thread, a known number ofthreads, or the presence of threads in a certain location as evidence ofillicit game activity (i.e., cheating) as identified by rules library304.

In some instances, even after certain devices are removed from thesystem 200, the various threads related to that device will not beentirely purged from the system 200, usually main memory 202 or IOPmemory 214. A query of client 102 may relate to the detection of theseso-called ‘ghost threads’ and indicate that while a user is notimmediately engaged in illicit game behavior the user may havepreviously engaged in such behavior and/or otherwise have the means toengage in such behavior in the future.

Queries may also pertain to identification of modules and strings ofdata in the system 200 as identified in the rules library 304. As thesemodules and strings may ‘move,’ especially in IOP memory 214,identification of the particular string or module versus a particularaddress may prove particularly useful with regard to actively validatinga network device. Further, the jump locations in a particular segment ofcode may be ‘nulled out’ whereby code that has been relocated as anormal part of the IOP operation may be verified.

While any one of the aforementioned embodiments may be utilized in thecontext of a query, the query engine 310 may automatically determine orcustomize the particular query in response to activity detected bymonitoring module 306 as may be the case in of passive validationarchitecture.

The analysis engine 308 may receive the data in response to the querygenerated by query engine 310 and determine whether the status of aclient device is invalid and reflects cheating or other illicitbehavior. If the client 102 fails to respond to the query from the queryengine 310, the client 102 may be ejected from the network communityeither temporarily or permanently. In some embodiments of the presentinvention, the period a client 102 or a particular user associated withthe client 102 at the time of ejection may increase with the number ofejections.

As previously noted, in some embodiments of the present invention, awindow of time is specified for responding to the query. If the client102 fails to respond to the query within that window of time, the server108 may send another query, eject the user or client 102 from thenetwork community, or allow the user to continue participating in thenetwork game 104 and continue to monitor the user's activity at client102.

In some embodiments of the present invention, like those related topassive validation, the analysis engine 308—in conjunction withmonitoring module 306—may decide that the query engine 310 does not needto send a query. For example, the analysis engine 308 may determine thatwhile a score associated with the network game 104 is high, it is notoutside the parameters for scores set forth in the rules associated withthe network game 104 as provided in the rules library 304 and otherwiseobserved by the monitoring module 306.

If the analysis engine 308 determines that the user is cheating, theoffending node may be ejected, allowed to continue playing, and soforth. In some embodiments, the server 108 or sending node may resolvethe violation (i.e., cheating activity) whereby various types ofresolution may be employed. In some embodiments of the presentinvention, the node tasked with resolving the behavior (e.g., server108) may disable a cheating device or offending code presently runningon the system 200 by sending a patch to remove, modify, or add to theoffending software.

In some embodiments, the analysis engine 308 may generate a list ofusers or client devices 102 that violate the rules associated with thenetwork game 104. In other words, the analysis engine 308 may generate acheater ‘rap sheet.’ The cheating users may then be monitored more oftenby the monitoring module 306 according to some embodiments or employedas a variable for generating future rules by the optional rulesgenerator 302.

In some embodiments, the client 102 may include certain or all of thecomponents discussed in FIG. 3 with regard to server 108 whereby devicebecomes more of a generic network node that may encompass serverfunctionality, client functionality, both or neither (e.g., a router,buffer or intermediate point on a network). Accordingly, the client 102can detect cheating activity occurring on other clients 102, asdiscussed herein. One node in the network may also generated queries ofother nodes in response to an initial request by a server 108.

Nodes may also act in peer-groups whereby, for example, ten particularnodes constitute a group. Groups may be defined by the particular needsor nature of a particular network environment. For example, a group mayconstitute all players of a network game 104. A group may constitute allplayers of a network game 104 and participating via a particular ISP. Agroup may also constitute players in a certain ‘game room,’ that is,players that have been invited to participate with one another orotherwise entered a particular gaming environment of particular users. Agroup may be defined by any parameter that allows for delineation of oneuser from another (e.g., age, experience, game device being used, timelogged on, type of network connection, bandwidth availability, etc.).

Other embodiments may provide for group participation in analysis ofcertain behavior. For example, multiple nodes (via monitoring module306) may observe behaviors from a particular node. The behaviorsobserved may be identical or each involving different game behaviorinformation. In some embodiments, an approval (e.g., validation) of sameor varying behaviors as observed by various nodes may be required by allor a certain percentage of the observing nodes to further ensure thevalidity of the observed node in the community network.

Furthermore, although various components are discussed in connectionwith FIG. 3, the server 108 and/or the client 102 may include more orfewer components and still fall within the scope of various embodimentsof the present invention. For example, responses to illicit behaviorsmay be carried out by a separate integrity module (not shown) inconjunction with or independent of, for example, analysis engine 308 asreferenced above.

In the case of a hybrid validation scheme, the analysis engine 308and/or the monitoring module 306, may then instruct the query engine 310to send one or more queries to the user's game device (system 200) inorder to gather data that helps the analysis engine 308 determinewhether the user activity qualifies as cheating. The query engine 310may send predetermined queries for the particular network game 104 orthe query engine 310 may generate specific queries for the network game104 based on the user activity that is flagged by the monitoring module306. The queries may or may not be directly related to the unusualbehavior observed by the monitoring module 306. A more detaileddiscussion of the generation, delivery, and analysis of queries is foundin co-pending U.S. patent application Ser. No. 11/386,039, which haspreviously been incorporated herein by reference.

Referring now to FIG. 4, a flow diagram of an exemplary process foractively validating network game users is shown. At step 402, a query issent to the one or more users. The query may be sent to a client 102associated with the one or more users based on detected unusualactivity, at specified intervals without detection of unusual activity,and so forth. Any method for determining when to send a query may beemployed. As discussed herein, the query may be customized according tothe network game user, the query may be predetermined, and so forth. Thequery may also comprise any type of query, such as a query requesting aspecific area of the memory associated with the network game 104 or thenetwork game user's participation in the game, a hash of the memory orspecified area of the memory, a hash of the memory and a salt associatedwith the memory requested, identification of threads, modules, stringsof data and so forth.

At step 404, an answer to the query is received. As discussed herein, insome embodiments, the one or more users may be ejected if the client 102fails to respond to the query either correctly and/or in a timelyfashion.

At step 406, it may determine whether the one or more users are validbased on the response to the query. As discussed herein, the networkgame user, may be considered valid if it is determined, by an analysisengine 308 at the server 108 or the other clients 102, that the networkgame user is not cheating, is not violating the rules associated withthe network game 104, and so on. The response to the query may beutilized to further query the network game user where the response isnot acceptable, or is otherwise suspicious.

The response may be analyzed by the analysis engine 308 in order todetermine whether the network game user is valid. As discussed herein,the network game user may be warned, ejected from the network game 104,further monitored, and so forth. As also discussed herein, the violationor cheating may be resolved according to some embodiments, such as bysending data to add to, modify, or delete the cheating device, with orwithout notice to the network game user. Any type of resolution iswithin the scope of various embodiments of the present invention.

In some embodiments, as discussed herein, a list of cheating networkgame users may be generated and recorded, or stored. In otherembodiments, a list of validated network game users may be generated. Inother words, a list of the network game users that are not determined tobe cheating may be generated, those users having established trust withthe community over a period of time. Accordingly, the network game usersthat are validated may be monitored less while the network game usersthat have a history of cheating may be monitored more, according to someembodiments, or as may be determined by optional rules generator 302.

Referring now to FIG. 5, a flow diagram of an exemplary process forpassively validating network game users according to various embodimentsof the present invention is shown. At step 502, one or more usersinteracting with a network game in a network game environment aremonitored. The network game, such as the network game 104 discussed inFIG. 1, may reside on the one or more clients 102 and/or on the server108. As discussed herein, the one or more users may comprise the networkgame users. The monitoring module 306 may monitor the interaction amongthe network game users by observing activity and/or data via the network106. For example, the monitoring module 306 may observe data transmittedfrom a first network game user to one or more second network game users,each associated with a client 102. In other embodiments, the data underobservation may comprise the posting of a score or the saving of gamedata (e.g., progress in a game) at the server 108.

At step 504, data is received from the one or more users as a part ofthe aforementioned monitoring process. As discussed herein, the data maybe received via the monitoring module 306 observing the network gameusers' interaction with the network game 104 and/or the data may bereceived as a result of the clients 102 posting data to the otherclients 102 or the server 108. Any type of data may be received from thenetwork game users according to exemplary embodiments.

At step 506, the data is evaluated to determine whether the one or moreusers adhere to one or more rules associated with the network game 104or if the data is otherwise indicative of illicit game play. Themonitoring module 306 may flag unusual network game user activity ordata posted by the client 102 either alone or in conjunction with theanalysis engine 310. This data may be evaluated as the data isposted/received or sometime after the data is posted/received. Forexample, analysis may occur during a level change, during a game save,during the introduction of a new player or departure of a player to/fromthe community, while a particular player is in a game lobby or waitingroom and so forth.

Utilizing the one or more rules associated with the network game 104(e.g., rules from library 304 including but not limited to various gamemetrics) the data may be evaluated to determine whether the network gameuser adheres to the rules while participating in the network game instep 506. For example, the one or more rules may indicate that thenetwork game user participating in a sports game (e.g., a football game)may not be allowed more than three time-outs as to prevent a particularuser an unfair advantage in plotting plays as the game advances. If theparticular network game user posts data, or the data is otherwiseobserved, that indicates the particular network game user has used fouror more time-outs, that user may be recognized as engaging in illicit(i.e., invalid) activity as the game user is presently failing to adhereto the rules defined by the particular network game 104 and/or ruleslibrary 304 (e.g., the user is violating a metric).

At step 508, the one or more users that adhere to the one or more rulesassociated with the network game 104 may be validated. As discussedherein, validating the network game user may comprise recognizing thevalidated network game user as legitimate, as a non-cheater, and soforth. In some embodiments, the validated network game user may bemonitored less frequently. In some embodiments, the network game usersthat are not “validated” may be monitored more frequently than validatednetwork game users. In yet other embodiments, the network game usersthat are recognized as cheaters based on failure to adhere to the rulesassociated with the network game 104 may be monitored more frequently,may be warned, and/or may be ejected from the network game 104. Any typeof action or inaction based on validating the network game user iswithin the scope of various embodiments.

FIG. 6 illustrates a flow diagram of an exemplary hybrid validationscheme according to various embodiments of the present invention whereinillegal game activity is identified. The illegal network game activitymay include violation of the rules associated with the network game104—including various metrics—or any other cheating activity by thenetwork game users (e.g., glitching).

At step 602 network game play is monitored. The monitoring module 306discussed in FIG. 3 may monitor user activity associated with thenetwork game 104.

At step 604, a determination whether there is anything unusual about aparticular player's actions in the network game 104 may be made. If nounusual activity is detected, the monitoring module 306 may continue tomonitor the network game user's activities in the network game 104. Thismethod is, in some respects, similar to the methodology set forth inFIG. 5. Unusual activity may constitute any activity that appears toviolate a particular rule or metric.

In the case of a hybrid validation architecture, however, if unusualactivity is detected in step 604, the query engine 310 may then send aquery to a client 102 (e.g., one associated with unusual activity) atstep 606 in response to the monitoring module's 306 identification ofillegal behavior, which might occur in conjunction with analysis engine308. Based on the response to the query, the analysis engine 308 maythen further determine whether the unusual activity is illegal at step608. If the node (e.g., client 102) is validated, monitoring module 306may continue to monitor activity of nodes like client 102 in thenetwork.

If the node (e.g., client 102) is not validated, certain illegalactivity may be resolved at step 610. Various resolutions may beemployed, such as sending software to the node to add to, modify, orremove the offending code, warning the user at the offending node,creating a watch list concerning the offending client/user, and soforth.

At step 612, the server 108 or, in a peer-to-peer or group-peerscenario, the clients 102, may determine whether to allow the networkgame user to continue to play in the network. If the network game useris allowed to continue to play, the node may remain subject to futurequeries and/or monitoring in active, passive or hybrid validationarchitectures as is appropriate. If the network game user is not allowedto continue, the server 108 or the other clients 102 may eject thenetwork game user, such as by ceasing data communication with theparticular network game user. In some embodiments, the network game userthat is not allowed to continue participating in the network game 104may be notified that the network game user is being ejected. In yetanother embodiment, the network game user may be denied futureparticipation in a particular network game or, in extreme cases, may bedenied access to the gaming network or community.

With respect to the aforementioned references to various game metrics asmay be employed for specific individual analysis (e.g., for the purposesof rule making and/or validation) and/or incorporation into an active,passive, and/or hybrid validation scheme, a game metric may be any rule,characteristic, aspect, definition, specification, classification,designation, taxonomy, nomenclature, measurement, property, function,principle, quality, guide, procedure, operation, law, order, control,restraint, regulation, decree, imperative, canon, tenet, directive,guideline, instruction, parameter, boundary, stricture, limitation,restriction, factor, consideration, check, or constraint applied to agame environment with regard to what may and may not happen in thatenvironment. Metrics may be absolutes (e.g., always or never). Metricsmay also be conditional (e.g., subject to conditions precedent orsubsequent). Metrics may also be applied to the environment (e.g., lawsof physics and game boundaries), objects within the environment (e.g.,the presence of certain objects at certain times and at certain placesand/or attributes related to those objects), and characters within theenvironment—both player and CPU controlled (e.g., character abilities,possessions, attributes, and so forth). Game metrics may also be appliedto any other aspect of a game environment subject to the whims of a gamedesigner or other ‘rule maker,’ which may be (but is not limited to) anautomated system (e.g., rules generator 302), a game player, or acommunity of like-minded game players.

Game metrics may be built-in to a particular game (e.g., part of a ruleslibrary obtained from an optical disc or over a network in response tothe play of the particular game). Game metrics may be part of an updatelibrary that may be downloaded to temporary memory, permanently saved inan ancillary memory device (such as a detachable memory card), oraccessed from a central depository or other network node (e.g., anothergame player) over a network during game play. Game metrics—as noted—mayalso be designed and implemented by a particular game player through,for example, an authoring tool that may be a part of a particular game,as an ancillary software tool related to the game, or through individualcoding of a metric that is subsequently installed at the proper point ofaccess for a particular game, system, or gaming and/or validationarchitecture.

In one exemplary embodiment of the present invention, determination ofwhether a game player is abiding by particular metrics may occur througha particular client device (e.g., a gaming system) regularly reportinggame data to, for example, a central game server (like server 108 ofFIG. 1) or another game player's network device (like client 102 of FIG.1). Analysis of that game data may take place as the game data isprocessed by the appropriate network device. For example, game datagenerated by one player may be analyzed by the opposing player withregard to abiding by particular game metrics as the first game player'sgame data is processed for display on the opposing player's gamingdevice. Similar analysis may take place at a central server prior to thegame data being sent by the central server to another game player orplayers.

Processing of game data with respect to various game metrics may alsotake place at an otherwise idle network device (e.g., a game deviceconnected to the network but presently idle as the game player is in a‘waiting room’ awaiting entry into a network game). This idle device mayanalyze the game data for compliance with various game metrics while thedevices of the game players who are actually in competition with oneanother may be focused on specific game play interactions wherebyprocessing power and bandwidth between the two players is reservedsolely or primarily for game play interactions (i.e., game metricanalysis takes place on a computing device not presently involved inactual game play). Analysis of game play data with respect to compliancewith various game metrics may also be distributed over a series ofnetworked devices for peer analysis or parallel processing as may occurthrough the use of, for example, a Cell processor.

Upon a determination that particular game play data does not correspondto a particular metric, a validation methodology may be implemented todetermine whether a game player with irregular or otherwise impropergame play data with respect to that particular metric is engaging inillicit behavior (i.e., cheating). Through a validation process, adetermination may be made with respect to a player who does not complywith a particular game metric (e.g., character abilities) and whetherthat player has an illicit game play device coupled to their clientdevice (102) allowing for these advanced abilities.

The validation may be transparent in that the metric violation isrecognized by a particular network device during the course of game playwhereby active, passive, or hybrid validation is subsequently requestedto take place all without the knowledge of the possible ‘cheater.’Validation of the purportedly offending network node may take place inconjunction with the network node that first recognized the metricviolation. Validation may also take place between the purportedlyoffending node and a network device dedicated or presently assigned tovalidation operations. Validation may also take place amongst a varietyof network devices as has been described in greater detail with respectto peer evaluation or parallel processing.

In one exemplary embodiment, a game metric may be related to the healthof a game character. For example, a game character, group of characters,companion character, or opposing characters (e.g., an enemy character ascontrolled by a CPU or by another player over a network) may beassociated with a measurement of health. In some instances, themeasurement may be reflected by hit points or a health percentage. Ameasurement of health may also be reflected as, for example, a visualdepiction such as a ‘health bar.’

As a game character competes in a game environment, the character mayencounter various obstacles that represent some hazard or detriment tothe health of the character. For example, the game character may be in agame environment simulating one-on-one combat such as a street fight ora boxing match. The game character may also be within a subsidiaryenvironment of a larger game environment; for example, the gamecharacter may be in a head-to-head networked hockey game and one gamecharacter may get into a fight with an opposing hockey player during thecourse of the game. The fight between the two hockey players, in thisexample, is a part of the game for the purpose of added of realism butis not the focus of the game. That is, the fight between the players isa subsidiary gaming environment of the primary hockey game environment.

As a game character engages in fisticuffs with an opponent (regardlessof whether the fight occurs in a primary or subsidiary gameenvironment), the character will inevitably be struck by an opponent.For example, the game character may suffer various blows to the body asmight occur through punches, kicks, or other physical activities such asbeing struck by objects (e.g., hit by a club swung by an opposingcharacter). As would generally occur in the real world, the gamecharacter may suffer physical detriment with each blow to the body.These blows might cause various degrees of damage dependent upon, forexample, the type of blow (e.g., a powerful upper cut versus a quickjab), the timing of the blow (e.g., a quick succession of blows or whenthe defense of a character is down), certain qualities of the othercharacter (e.g., fighting skill or strength), certain qualities of thecharacter under attack (e.g., stamina), whether any interveninginstrumentality is involved (e.g., a first or a club or body armor wornby the party under attack), and the location where the blow is suffered(e.g., the head versus the chest versus the stomach).

With each blow suffered by the body of the character, the health of thegame character may also suffer. The decrease in health may berepresented in a variety of ways. For example, a hit point may besubtracted with each blow or a series of blows dependent upon, forexample, the nature of the blow. Similarly, an overall health percentagemay drop as attacks on the character continue. For example, thecharacter may be at a particular percentage of overall health at onepoint in the fight and a lower percentage later on in the fight. Asattacks on the character continue, blows suffered later in the fightwherein the character may possess lesser health may be more detrimentalthan those blows suffered at the outset of the fight when the characterwas stronger. If health is represented visually, a health bar may dropor a damage bar may increase during the course of combat.

In some instances, illicit game activity may offer invincibility orincreased ability to withstand attacks to a game character under thecontrol of the cheating user. For example, a game character may bestruck repeatedly with a weapon (e.g., a sword). Notwithstanding theattack with a particularly dangerous weapon, if the game character hasbeen illicitly granted invincibility, those attacks may cause little tono damage. In accordance with a particular game metric, however, it maybe known that each blow inflicted by a particular weapon in a particularscenario results in the loss of a certain health percentage, hit points,and so forth. If the measurement of health fails to change in accordancewith the game metric representative of health adjustments, thisun-proportional adjustment in health may be indicative of illicit gamebehavior as made by possible by an illicit gaming device or code.

The initial illicit game activity (e.g., unwarranted invincibility) maybe detected as a part of an active reporting of health status to, forexample, a central game server (108) or other network device (e.g., theopposing game player's game client 102). The health status informationas it pertains to the present combat may also be recognized throughpassive observation of game data at the aforementioned central gameserver (108) or other client device (102) on the network such as theother game player's system or an intermediate peer node (or group ofnodes). The observation of the health status not adjusting in accordancewith the particular game metric may, in and of itself, result in adetermination of cheating based on, for example, the particular game ormay result in the implementation of another validation mechanism (e.g.,the activation and focused observation of a passive validationmechanism) or the issuance of a particular query (e.g., in the case ofan active validation mechanism) that then focuses on specific validationdata (e.g., the presence of illicit code).

Other health related metrics may be applied in addition to simplereductions in health relative to a particular attack. For example, auser may attempt to inhibit the health of another game character (e.g.,a competitor). In this instance, a particular attack may result in onlya loss of a particular number of hit points. Through illicit cheating,however, the attack may be ‘amplified’ such that excessive hit pointsare taken away from the player under attack or that certain defenses(e.g., armor) are nullified.

Additionally, a player may be able to ‘regain’ health through, forexample, resting, ingesting health-related potions, utilizing first aidkits, or eating as may be subject to the particular game environmentand/or story-line. In this example, a user may obtain more health pointsfrom a healing activity than should be normally granted. For example, aparticular potion may be associated with the regaining of a particularnumber of hit points. Through illicit activity, however, that number maybe doubled or otherwise altered such that the benefit is more than thatintended by the particular designer and/or limits of the game. Thisactivity may also be governed and observed through a game metric.

Additionally, the consumption of more health ‘rewards’ than are actuallypresent in the game environment may be indicative of illicit behavior.For example, if a user starts with 100 hit points and then legitimatelyloses 60 of those points in combat, the user is left with 40 hit points.The particular game environment (e.g., a level) may have three health‘packets’ present, the packets causing the regeneration of health. Twoof those packets may be worth a 10 hit point increase while the third isworth 20. If, however, the game character is suddenly determined toagain have 100 hit points in the environment following theaforementioned combat exchange (as may be caused through an illicitcheating device or cheat code), this change would violate a particularhealth metric in that it is mathematically impossible (in a valid gameenvironment) to go from 40 hit points to 100 hit points—a 60 pointincrease—when all of the health resources combined in the environmentwould only provide a 40 point increase. If a game player goes over amaximum number of hit points (e.g., 120 hit points when 100 is themaximum), this may also indicate some illicit manipulation of the gameenvironment through illicit behavior that may warrant the implementationof additional validation (e.g., passive, active or a hybrid approach) orstraight forward resolution of the potentially illicit behavior.

In some instances, however, game designers may wish for game players toobtain certain reward codes that actually allow for game play that isabnormal. For example, a special reward of five seconds of invisibilityfor achieving an in-game reward or for inputting a secret code obtainedfrom a game resource officially sponsored by the game. In theseinstances, the implementation of the authorized cheat (e.g., an ‘EasterEgg’) may be reflected in the game data that is actively reported and/orobserved during the course of game play. If game data comprises anindicator that the behavior is the result of an ‘authorized cheat,’ thenfurther validation may not be necessary as the game metric may reflectexceptions to the rule (e.g., metric violations caused as the result ofan authorized cheat code).

Similar health-related game metrics may be implemented with regard toother game character features such as stamina. For example, a gamecharacter may be able to perform particular tasks, moves, skills,actions, and so forth subject to the maintenance of stamina above aparticular level or percentage. As the stamina level of a characterdrops, however, abilities of the game character may suffer (e.g., theability to absorb certain attacks or to perform certain skilled moves,etc.). In these instances, if stamina is illicitly altered as referencedabove, the violation of a particular metric may indicate the need toactivate a validation mechanism or to other take efforts to maintaincommunity integrity.

For example, a game character may be traversing a desert or otherextreme environment during the course of game play (e.g., a poison gasfield or a volcanic field). As the character traverses that environment,overall health may suffer but stamina may also drop (i.e., the charactercan only survive so much adverse physical activity for so long beforethat activity begins to affect overall health and begin subtractinghealth points). If stamina is unaltered despite being in a particularenvironment, this may be indicative of illicit behavior in that themetric and general rules of the environment have been violated (e.g.,any character in the volcano for a particular period of time should seea pre-determined drop in overall stamina). Again, like health, theeffect on stamina of a game character can be positive (e.g., irregularincreases in stamina with respect to the environment or charactercharacteristics) or negative (e.g., a particular drop in stamina such asfatigue is absent notwithstanding the extremes of a particularenvironment). In either case, the alteration may constitute theviolation of a game metric that reflects the need for validation and/orcommunity integrity maintenance.

It should be noted that various game metrics may exhibit certain degreesof flexibility. For example, a warrior may have higher health and higherstamina than would a magician. As such, there may be an overall metricthat applies to health (e.g., a certain attack with a certain weaponshould cause a drop in hit points) but that the metric may change basedon other characteristics such as the type of game character. Forexample, being attacked with a club in the case of a warrior may causedamage but only in small increments. The much weaker magician, however,may suffer grave harm with each attack and may only be able to survivethree or four blows before succumbing entirely to the injury. In thatregard, if a particular character is seeing an alteration in health orstamina but not at a rate or percentage as associated with thatparticular character or other specific characteristics of the character,then this irregularity and violation of the game metric may reflect theneed to implement a validation scheme and/or institute some element ofmaintaining community integrity.

Speed of a character may also be subject to a game metric. For example,a particular character may only be capable of running at a particularrate. Through illicit behavior, however, the character may be givenunwarranted or undeserved boosts of speed. If a character is traversingan environment in excess of a norm (or limit), this activity mayconstitute violation of a game metric and reflect the need to institutevalidation and/or community integrity maintenance.

Game metrics may also be imposed with regard to capabilities orattributes of a character. For example, a wizard may be able to performa series of spells whereas a warrior may have no magical powers. Ifduring the course of the game, game data reflects that the warrior iscasting magic spells, this may be indicative of a breach of the gamemetric governing capabilities (e.g., magic) or other characterattributes.

By further example, a warrior may never be able to use a particularobject, or understand certain information in an environment, orcommunicate with other game characters because of various attributes(e.g., dexterity, intelligence, and charisma, respectively). If thatcharacter is suddenly able to use a previously unusable object, tounderstand and utilize previous incomprehensible information, or toengage in an exchange of information with a previously inaccessiblecharacter, the metric as it applies to the particular activity and/orattribute may have been violated and validation and/or communityintegrity activities may become necessary.

Certain prerequisites may also be implemented in a game metric. Forexample, a game character may be able (in a civilization building gamefor example) to build an arsenal of nuclear weapons. The development ofthat arsenal may only be possible, however, if the game player hasachieved certain technological advances with regard to rocket propelledflight, nuclear science, and aerospace navigation. If the game characteris found to have nuclear weapons without having achieved certainprerequisites (e.g., rocket propelled flight), the failure to satisfythe prerequisite metric may be indicative of illicit behavior and theneed to maintain community integrity or implement a further validationactivity to check for illicit gaming devices or other behavior.

Similarly, the prerequisite may pertain to a particular skill, weapon,level, or task in a game. For example, a particular magical power mayrequire learning a series of foundation or more elementary spells. Thehigher level magical power may, however, be more powerful and usefulthan the lower level, elementary spells. As such, a game player may havelittle to no interest in learning the lower level spells and engage insome illicit activity in order to obtain access to the higher levelspell. The presence of that higher order spell in the absence of thelower-level prerequisite spells may indicate the violation of aparticular game metric as it pertains to prerequisites. Likewise, if agame player obtains access to a higher level of a game or a morepowerful weapon without first having satisfied some lower levelprerequisite, illicit activity may be in effect and subject to detectionby a passive, active, or hybrid validation scheme or the implementationof some action in order to maintain community integrity.

Metrics may also be imposed with regard to ammunition and/or theavailability of particular weapons in an environment. For example, if abattlefield environment is populated only with a machine gun, a rocketpropelled grenade, and a knife and a game character is then engaged incombat with a tank, the weapons metric may have been violated.Similarly, if the environment only has 10 rounds of ammunition for therocket propelled grenade and the game character has fired off 15 roundsor has 15 rounds in their inventory, the metric again may have beenviolated, which may call for community integrity maintenance or somealternative validation activity.

The appearance of certain assets in a particular environment may beassociated with a game metric. For example, only certain objects (e.g.,weapons or rewards) may be found in certain levels and at certain times.If a particular weapon appears outside its predetermined level or timeframe as may be governed by a particular game metric, illicit gameactivity may be in progress. As such, it may be necessary to engage incommunity integrity maintenance or to implement a validation routine.Similarly, if the game character obtains more of a particular asset thanis presently available (e.g., 100 gold bars when only 10 are present),then the metric may have been illicitly violated. As may be the case inany or all of metrics of the present invention, certain ‘Easter Eggs’ orapproved ‘game enhancement cheats’ may be identified either through gamedata or validation data as may be appropriate with respect to aparticular game. In those instances, an indication that certain activityis the result of an ‘authorized’ cheat may not institute a furthervalidation or community integrity process.

Metrics may also be applied to experience or ability of a gamecharacter. For example, as a game character advances through a game,engages in certain tasks, and completes certain objectives, the gamecharacter may become more experienced with regard to repeating thosetasks in the future. In one example, if a game character is required toswim in a body of water, the character may be required to hold theirbreath as they swim underwater. Early on in game play, the gamecharacter may only be able to hold their breath for five seconds at atime thus requiring resurfacing for a new breath of air. As the gameplayer engages in swimming over the course of the game, they may be ableto hold their breath for extended periods of time (e.g., 30 seconds or45 seconds). This increase, however, may be associated with particularexperience in the game. For example, for every additional 1 second of‘breath holding’ time, a game player must spend at least 5 minutes ofgame time swimming. If a particular ability or skill level is obtainedwithout the proper experience associated with that ability, a gamemetric may have been violated indicating the need for the implementationof a validation scheme or community integrity maintenance.

A game metric may also be associated with the frequency of appearance ofobjects in a game environment. For example, in some games, variousobjects are presented for use by the game player such as weapons. Thoseobjects (after having been acquired by a game player) may reappear inthe environment over the course of time (e.g., rounds of ammunition mayreappear 45 seconds after having been acquired). If an object reappearsand is reacquired by a user prior to its particular frequency timeperiod (e.g., a 45-second frequency object appears after 10-seconds),this may be indicative of a game metric violation in need of validationor integrity assurances.

A game metric may also apply to the particular power of an object. Forexample, a certain weapon or combat skill may result in a particularamount of damage to another character. Through various illicit game playdevices or means, the power of that weapon, object, skill, and so forthmay be amplified. If a weapon—albeit legitimately obtained—results inillegitimate results (e.g., opposing character damage), this mayindicate the violation of a game metric in need of validation orintegrity maintenance.

Game metrics may also be applied to temporal aspects of a game as hasbeen previously referenced. For example, in a sporting event game, auser may have three-time outs. If a user is found to have called afourth time-out as may be made possible through a cheat device, a gamemetric may have been violated thus requiring a subsequent validation orintegrity maintenance process. Similarly, if a game has a ten minutegame clock but (through, for example, an illicit game play device orother means) is manipulated to a shorter or longer time period as maybenefit a particular player in a particular environment, a game metricmay have been violated thus indicating the need for validation.

Metrics may also be implemented with regard to score. For example, aparticular video game may implement an underlying mathematicaldetermination with regard to collective skills of one player or teamversus the collective skills of another player or team subject tocertain variables controlled by the natural abilities of the actual gameplayer. If one particular team (e.g., a low talent team X) beats anotherteam (e.g., a high talent team Y) and does so outside the aforementionednatural game play abilities variable (e.g., team X should not be able tobeat team Y by more than Z points), this may be indicative of illicitgame play and suggest the need for validation or community maintenance.

Certain difficulties may accompany this metric in that certain gameplayers are more skilled than others and other random or chaoticvariable may result in a particular situation wherein team X does, infact, beat team Y by more than the normal variable of Z points. Itshould first be noted that the lesser team beating the better team isnot, in and of itself, indicative of illicit behavior. The defeat of thesuperior team may simply be an indication that illicit behavior may bein effect and that validation is necessary. It is quite possible that‘on any given day’ one team may beat another. If this is such aninstance, then the validation procedure should return a positive reportreflecting the non-existence of illicit gaming tools (e.g., hardware,software, or related peripherals).

Notwithstanding this possibility of ‘any given team on any given day’defeating a superior team (or force in the case of a military game), thegame metric may—if a team exceeds the particular likelihood of victoryor point differential in victory—look to previous game playerperformance as may be stored locally on the game player's device or at acentral server maintaining a history of player performance. If aparticular player has a regular and consistent history of lesser levelteams beating higher level teams or regularly exceeding an average orpredicted margin of victory, this determination may be a more accurateindicator of illicit behavior and indicate the need for validation of aparticular network device or the implementation of community integritymaintenance.

Various other metrics may be implemented with respect to the physicaluniverse of a particular game environment. In some video games, forexample, a programming error may occur during game development that ismissed during quality control. This error—while not necessarily fatal tothe operation of the game—may allow for a certain player to obtain anadvantage over another player, especially if other players are unawareof the condition. The advantageous use of these errors (or glitches) isoften referred to as “glitching.”

For example, a game environment may be comprised of a series ofoverlapping polygons. In the proper arrangement and with the propertextures and shading, these polygons appear as, for example, an aridmountain range that runs along side the edge of a video game environment(e.g., a desert warfare environment). In such an example, the mountainrange may be represent the edge or boundary of the gaming environmentbeyond which the character and various game objects cannot (or are notintended to) interact. In some instances, however, through either anerror during the software coding process or some other processing error,a ‘crack’ may appear between two or more polygons. A game player, ifaware of this crack (glitch), may cause their game character to passthrough this glitch and exist outside of the formal, defined gamingenvironment.

This game character that now appears outside the defined gamingenvironment may be able to continue to view the actual game environmentin that one face of a polygon (i.e., the game environment side) may betextured or shaded (and thus opaque and incapable of being seen through)but the other face—the face outside of the game environment—may not besubject to any shading or texturing in that this side of the object wasnot intended to be viewed by game players, which is sometimes referredto as backface culling. Backface culling is the process by whichpolygons that are not facing the game environment are removed from arendering pipeline. Further, certain rules governing the gameenvironment may fail to be recognized or may not be applied outside thegame environment as it was not intended for a game character to beengaged in game play outside of the defined environment. Thus, certainrules of the game that would normally see fired munitions ricochet offthe mountain range may not apply on the ‘other side’ of the range. Assuch, the game character that is taking advantage of the glitch mayactually be able to see ‘into’ the gaming environment without being seenby other game players because of the backface culling and, further, fire‘into’ the game environment at enemy characters. Game players that areabiding by the rules of the game and that remain within the environment,in addition to not being able to see their attacker because of theopaque nature of the object environment, may not even be able to returnfire in that their attack would be repelled by the face of the mountain(e.g., a rule governing the interaction of munitions and hardenvironmental objects).

In this example, however, the fact that certain activity is taking placeoutside the game environment may not necessarily indicate that anillicit gaming device is coupled to a game system and that the networkdevice needs to be validated. While the game player is ‘technically’cheating (in the sense that the game player has an unfair advantage),the player may be doing nothing more than taking advantage of anerroneously coded game environment. As such, validation of the gameplaying device may reflect that the device is not coupled to orotherwise benefiting from an illicit game play device. In theseinstances (i.e., cheating without external assistance), the validationarchitecture may still recognize illicit behavior, the absence of anillicit game play device, the further absence of any exception to a gameplay rule allowing for the questionable behavior (e.g., an Easter Egg)and subsequently take action (or cause for action to be taken) withregard to maintaining community integrity (e.g., killing the character,re-‘spawning’ the character in the game environment with or without thepenalty of, for example, a lost life, or pausing real-time game playuntil the character reenters the normal bounds of the game environment).

Glitching may also relate to the game player being able to positiontheir game character within the normal and defined game environment atpositions wherein access is otherwise not possible (or least notintended). For example, the top of a building may offer a perfectvantage point for a sniper in a military role playing game. The buildingmay offer a bird's eye view of a large portion of the game environmentand may further offer particular cover for the sniper such that othergame players cannot return fire and kill the sniper. Notwithstanding theadvantages of this particular position, access to the rooftop positionmay not be possible (e.g., the intentional lack of stairs or other meansintended for ascending to the top of the building such as a stack ofcrates). A game player may, however, discover a way to access the top ofthe building (e.g., parachuting from a plane to the top of the building)not otherwise anticipated by the game designers.

Despite the game designer intending for this portion of the game to beinaccessible, the forbidden environment nonetheless exists and the gameplayer may be able to access the same and gain an unfair advantage overother game players. In these instances (i.e., cheating without externalassistance), the validation architecture again may recognize illicitbehavior, the absence of an illicit game play device, the furtherabsence of any exception to a game play rule allowing for thequestionable behavior (e.g., an Easter Egg) and subsequently take action(or cause for action to be taken) with regard to maintaining communityintegrity (e.g., killing the character, re-‘spawning’ the character inthe game environment with or without the penalty of, for example, a lostlife, or pausing real-time game play until the character reenters theintended bounds of the game environment).

Similarly, a game player may discover a bug or other error in gamedesign that allows them to traverse large portions of the gameenvironment in less than the normal time to move between two points. Forexample, a game environment may span fifty miles from East-to-West. Agame character may only be able to traverse the environment at a rate offive miles per (game) hour. As such, it should take the game player tenhours (in game time, which may or may not correspond to real-world time)to traverse the entire environment. A game player may discover a glitchin the coding that causes a character to be positioned in one portion ofan environment and to nearly instantaneously appear in another portionof the game environment (e.g., the opposite side of the environment). Inthis ‘transporter’-like example, the game character may traverse the 50mile environment in mere seconds of game time—speed that is physicallyimpossible within the constructs of the particular game environment(i.e., as governed by a particular game metric).

Despite the game player having violated the game universe's laws ofphysics, the game player may nevertheless be able to violate those lawsof physics and gain an unfair advantage over other game players. Inthese instances (i.e., cheating without external assistance), thevalidation architecture may recognize illicit behavior, the absence ofan illicit game play device, the further absence of any exception to agame play rule allowing for the questionable behavior (e.g., an EasterEgg) and subsequently take action (or cause for action to be taken) withregard to maintaining community integrity. This community maintenancemay include killing the character or re-‘spawning’ the character in thegame environment with or without the penalty of, for example, a lostlife.

Violating the game laws of physics may also occur in the context of anillicit game play device. For example, an automobile that only travelsat 30 miles per hour may be traveling at 50 miles per hour with theassistance of a cheat device. The validation architecture, in thisexample, may undertake a validation activity and actually recognize thecheat device and take the appropriate action to maintain communityintegrity (e.g., disabling the offending code and/or device).

While various embodiments have been described above, it should beunderstood that they have been presented by way of example only, and notlimitation. For example, any of the elements associated with the client102, the network game 104, and/or the server 108 may employ any of thedesired functionality set forth hereinabove. Thus, the breadth and scopeof a preferred embodiment should not be limited by any of theabove-described exemplary embodiments.

The present invention may be further implemented in a common networkgame 104 that is operable over a mixed network of end user devices(e.g., clients 102). For example, one client device 102 may be apersonal computer; a second client device 102 may be a homeentertainment system such as a PlayStation® 2 or PlayStation® 3available from Sony Computer Entertainment Inc. Another client device102 may be a portable gaming device such as a PSP™ (also from SonyComputer Entertainment Inc.) whereas a fourth client 102 may be a homeentertainment system of a different manufacture such as an Xbox asmanufactured by Microsoft Corporation or a GameCube as manufactured byNintendo Co., Ltd. The present anti-cheat methodologies described hereinare fully intended to be operable amongst a related or non-related groupof devices.

1. (canceled)
 2. A method for monitoring a gaming network, the methodcomprising: evaluating a plurality of computing devices associated withthe gaming network to identify one or more of the computing deviceshaving idle processing resources; assigning the identified computingdevices monitoring responsibility over one or more client devicesparticipating within a network game session; monitoring current networktraffic associated with the gaming network; and modifying performance ofthe monitoring responsibility by the assigned computing devices based onthe current network traffic, wherein the performance of the monitoringresponsibility is delayed when the current network traffic is identifiedas high.
 3. The method of claim 2, wherein the monitoring responsibilityincludes monitoring for illicit behaviors by the client devicesparticipating within the network game session.
 4. The method of claim 2,wherein the monitoring responsibility includes passive validation ofgame data generated by the client devices participating within thenetwork game session.
 5. The method of claim 2, wherein the monitoringresponsibility includes active validation of one or more responses toqueries transmitted to the client devices participating within thenetwork game session.
 6. The method of claim 5, wherein the monitoringresponsibility further includes transmitting the queries to the clientdevices based on a pre-determined schedule.
 7. The method of claim 5,wherein the queries are customized to the client devices.
 8. The methodof claim 5, wherein the queries are customized to a detected activity bythe client devices.
 9. The method of claim 5, wherein modifyingperformance of the monitoring responsibility includes adjusting aresponse time for receiving the responses.
 10. The method of claim 2,wherein the monitoring responsibility includes applying a set of rulesthat define game metrics for allowed and prohibited behaviors within thenetwork game.
 11. The method of claim 2, wherein the monitoringresponsibility includes monitoring for one or more device signaturesindicative of prohibited devices.
 12. The method of claim 2, wherein theassigned computing devices include client devices that are notparticipating in the network game session.
 13. The method of claim 2further comprising downloading instructions for performing themonitoring responsibility to each of the assigned computing devices. 14.The method of claim 13, wherein the downloaded instructions include arules library associated with a game title being played in the networkgame session.
 15. The method of claim 13, wherein the downloadedinstructions includes permissions information specific to one or more ofthe client devices participating in the network game session.
 16. Themethod of claim 2, further comprising reassigning the monitoringresponsibility to a different one of the computing devices based on anupdated evaluation identifying that the different computing device hasidle processing resources.
 17. The method of claim 2, further comprisingreceiving monitoring data from the assigned computing devices, anddetermining whether the client devices are allowed to continueparticipating in the network game session.
 18. The method of claim 2,wherein assigning the monitoring responsibility includes assigningdifferent types of monitoring responsibility to different assignedcomputing devices.
 19. A system for monitoring a client device in agaming network, the system comprising: a plurality of computing devicesassociated with the gaming network, the computing devices including oneor more client devices participating in a network game session; and aserver that includes instructions stored in memory, the instructionsbeing executed by a processor to: evaluate the plurality of computingdevices associated with the gaming network to identify one or more ofthe computing devices having idle processing resources, assign theidentified computing devices monitoring responsibility over the clientdevices participating within the network game session, wherein theassigned computing devices monitor current network traffic associatedwith the gaming network and modify performance of the monitoringresponsibility based on the current network traffic, wherein theperformance of the monitoring responsibility is delayed when the currentnetwork traffic is identified as high.
 20. A non-transitory,computer-readable storage medium having embodied thereon a programexecutable by a processor to perform a method for monitoring a gamingnetwork, the method comprising: evaluating a plurality of computingdevices associated with the gaming network to identify one or more ofthe computing devices having idle processing resources; assigning theidentified computing devices monitoring responsibility over one or moreclient devices participating within a network game session; monitoringcurrent network traffic associated with the gaming network; andmodifying performance of the monitoring responsibility by the assignedcomputing devices based on the current network traffic, wherein theperformance of the monitoring responsibility is delayed when the currentnetwork traffic is identified as high.